Locality-sensitive hashing - PDFSEARCH.IO - Document Search Engine

Locality-sensitive hashing
Results: 117

#	Item
31	JMLR: Workshop and Conference Proceedings vol–21 Randomized partition trees for exact nearest neighbor search Sanjoy Dasgupta Add to Reading List Source URL: jmlr.org Language: English - Date: 2013-06-18 21:17:29 Search algorithms Nearest neighbor search K-d tree K-nearest neighbors algorithm Locality-sensitive hashing R-tree Cover tree Expected value
32	Predictive Indexing for Fast Search Sharad Goel Yahoo! Research New York, NY 10018 Add to Reading List Source URL: hunch.net Language: English - Date: 2009-01-12 15:37:21 Information science Search algorithms Information retrieval Nearest neighbor search Locality-sensitive hashing Similarity search PageRank Search engine indexing Computational geometry Hash function IDistance Search engine technology
33	Beyond Locality-Sensitive Hashing Alexandr Andoni (Microsoft Research), Piotr Indyk (MIT), Huy L. Nguyen (Princeton) and Ilya Razenshteyn (MIT) (Approximate) Near Neighbor Problem ((A)NN) The main approach: data-depende Add to Reading List Source URL: ilyaraz.org Language: English - Date: 2014-04-21 21:52:06
34	Real-Time Recommendation of Diverse Related Articles Sofiane Abbar Sihem Amer-Yahia Piotr Indyk Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Search algorithms Hashing Dimension reduction Locality-sensitive hashing Error detection and correction Hash function Relevance Recommender system K-nearest neighbors algorithm
35	Beyond Locality-Sensitive Hashing Alexandr Andoni1 Piotr Indyk2 Huy L. Nguy˜ên3 Ilya Razenshteyn2 1 Microsoft Research SVC Add to Reading List Source URL: ilyaraz.org Language: English - Date: 2014-01-06 16:21:36
36	On the Difficulty of Nearest Neighbor Search Add to Reading List Source URL: www.sanjivk.com Language: English - Date: 2012-06-12 10:12:20 Data analysis Numerical analysis Summary statistics Nearest neighbor search Locality-sensitive hashing Principal component analysis Normal distribution Curse of dimensionality Supervised learning Statistics Search algorithms Machine learning
37	Beyond Locality-Sensitive Hashing Alexandr Andoni (Microsoft Research), Piotr Indyk (MIT), Huy L. Nguyen (Princeton) and Ilya Razenshteyn (MIT) (Approximate) Near Neighbor Problem ((A)NN) The main approach: data-depende Add to Reading List Source URL: www.ilyaraz.org Language: English - Date: 2014-04-21 21:52:06 Information retrieval Locality-sensitive hashing Hash function Hash table Piotr Indyk Search algorithms Artificial intelligence Information science
38	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search Michael Kapralov IBM Watson December 5, 2014 Abstract Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2015-05-27 02:11:51 Information retrieval Dimension reduction Locality-sensitive hashing Nearest neighbor search SL XTR Information science Search algorithms Mathematics